ProbDB: Efficient Execution of Aggregate Queries over Probabilistic Data
نویسندگان
چکیده
Les requêtes d’agrégats sont essentielles dans de nombreuses applications qui gèrent des données incertaines. Cependant, calculer de manière efficace ces requêtes est généralement difficile. Dans cette démonstration nous présentons ProbDB, un système de gestion de bases de données probabilistes. Nous montrons en particulier l’efficacité de ProbDB lors du calcul de requêtes avec agrégats tels que SUM et COUNT. L’application sur laquelle notre démonstration se repose est une application médicale, et elle montre la rapidité avec laquelle ProbDB répond aux requêtes d’agrégats probabilistes.
منابع مشابه
ارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملEfficient Evaluation of HAVING Queries on a Probabilistic Database
We study the evaluation of positive conjunctive queries with Boolean aggregate tests (similar to HAVING queries in SQL) on probabilistic databases. Our motivation is to handle aggregate queries over imprecise data resulting from information integration or information extraction. More precisely, we study conjunctive queries with predicate aggregates using MIN, MAX, COUNT, SUM, AVG or COUNT(DISTI...
متن کاملSUM Query Processing over Probabilistic Data
SUM queries are crucial for many applications that need to deal with probabilistic data. In this report, we are interested in the queries, called ALL_SUM, that return all possible sum values and their probabilities. In general, there is no efficient solution for the problem of evaluating ALL_SUM queries. But, for many practical applications, where aggregate values are small integers or real num...
متن کاملEfficient SUM Query Processing over Uncertain Data
SUM queries are crucial for many applications that need to deal with probabilistic data. In this paper, we are interested in the queries, called ALL_SUM, that return all possible sum values and their probabilities. In general, there is no efficient solution for the problem of evaluating ALL_SUM queries. But, for many practical applications, where aggregate values are small integers or real numb...
متن کاملProcessing Aggregate Queries in a Federation of SPARQL Endpoints
More andmore RDF data is exposed on theWeb via SPARQL endpoints. With the recent SPARQL 1.1 standard, these datasets can be queried in novel and more powerful ways, e.g., complex analysis tasks involving grouping and aggregation, and even data frommultiple SPARQL endpoints, can now be formulated in a single query. This enables Business Intelligence applications that access data from federated w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011